Smoothing Probability Distributions
نویسندگان
چکیده
We introduce smooth entropy as a measure for the number of almost uniform random bits that can be extracted from a source by probabilistic algorithms. The extraction process should be universal in the sense that it does not require the distribution of the source to be known. Rather, it should work for all sources with a certain structural property, such as a bound on the maximal probability of any value. The concept of smooth entropy uniies previous work on privacy ampliication and entropy smoothing in pseudorandom generation. It enables us to systematically investigate the spoiling knowledge proof technique to obtain lower bounds on smooth entropy and to show new connections to R enyi entropy of order > 1.
منابع مشابه
Generalized Probability Smoothing
In this work we consider a generalized version of Probability Smoothing, the core elementary model for sequential prediction in the state of the art PAQ family of data compression algorithms. Our main contribution is a code length analysis that considers the redundancy of Probability Smoothing with respect to a Piecewise Stationary Source. The analysis holds for a finite alphabet and expresses ...
متن کاملUsing PROC GENMOD for Loglinear Smoothing
AND INTRODUCTION The goal of smoothing is to replace an observed frequency distribution with a distribution that preserves some features of the observed data without the irregularities that are attributable to sampling. The type of smoothing covered in this paper involves the fitting of loglinear, Poisson-based models to discrete distributions. Loglinear smoothing can preserve a variety of diff...
متن کاملDecision Trees for Ranking: Effect of new smoothing methods, new splitting criteria and simple pruning methods
In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that takes into account the class distributions of all the nodes from the root to each leaf. This enhances probability estimations with respect to other previous approaches without smoothing or with Laplace correction. Secondly, we...
متن کاملKernel Density Estimation for An Anomaly Based Intrusion Detection System
This paper presents a new nonparametric method to simulate probability density functions of some random variables raised in characterizing an anomaly based intrusion detection system (ABIDS). A group of kernel density estimators is constructed and the criterions for bandwidth selection are discussed. In addition, statistical parameters of these distributions are computed, which can be used dire...
متن کاملA Note on the Smoothed Complexity of the Single-Source Shortest Path Problem
Banderier, Beier and Mehlhorn [BBM03] showed that the single-source shortest path problem has smoothed complexity w w "| | if the edge costs are -bit integers and the last least significant bits are perturbed randomly. Their analysis holds if each bit is set to or 6 with probability . We extend their result and show that the same analysis goes through for a large class of probability distributi...
متن کامل